Existence of stationary points for pseudo-linear regression identification algorithms
نویسندگان
چکیده
منابع مشابه
Existence of stationary points for pseudo-linear regression identification algorithms
The authors prove existence of a stable transfer function satisfying the nonlinear equations characterizing an asymptotic stationary point, in undermodeled cases, for a class of pseudo-linear regression algorithms, including Landau’s algorithm, the Feintuch algorithm, and (S)HARF. The proof applies to all degrees of undermodeling and assumes only that the input power spectral density function i...
متن کاملAlgorithms for Generalized Cluster-wise Linear Regression
Cluster-wise linear regression (CLR), a clustering problem intertwined with regression, is to find clusters of entities such that the overall sum of squared errors from regressions performed over these clusters is minimized, where each cluster may have different variances. We generalize the CLR problem by allowing each entity to have more than one observation, and refer to it as generalized CLR...
متن کاملPractical Algorithms for Pattern Based Linear Regression
We consider the problem of discovering the optimal pattern from a set of strings and associated numeric attribute values. The goodness of a pattern is measured by the correlation between the number of occurrences of the pattern in each string, and the numeric attribute value assigned to the string. We present two algorithms based on suffix trees, that can find the optimal substring pattern in O...
متن کاملStudy of a Pseudo-stationary State for a Corrosion Model: Existence and Numerical Approximation
In this paper, we consider a system of partial differential equations describing the pseudo-stationary state of a dense oxide layer. We investigate the question of existence of a solution to the system and we design a numerical scheme for its approximation. Numerical experiments with real-life data shows the efficiency of the method. Then, the analysis is fulfilled on some simplified models.
متن کاملPseudo-reward Algorithms for Contextual Bandits with Linear Payoff Functions
We study the contextual bandit problem with linear payoff functions, which is a generalization of the traditional multi-armed bandit problem. In the contextual bandit problem, the learner needs to iteratively select an action based on an observed context, and receives a linear score on only the selected action as the reward feedback. Motivated by the observation that better performance is achie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 1999
ISSN: 0018-9286
DOI: 10.1109/9.763215